home *** CD-ROM | disk | FTP | other *** search
/ NetNews Offline 2 / NetNews Offline Volume 2.iso / news / comp / lang / c-part1 / 457 < prev    next >
Encoding:
Text File  |  1996-08-05  |  1.6 KB  |  47 lines
  1. Newsgroups: comp.lang.c
  2. Path: hkusuc.hku.hk!hkusua!h9300377
  3. From: h9300377@hkusua.hku.hk (Chi-Ping)
  4. Subject: Geometry problem! 
  5. X-Nntp-Posting-Host: hkusua.hku.hk
  6. Message-ID: <DKprpJ.M8A.0.-s@hkusuc.hku.hk>
  7. Summary: polygon 
  8. Keywords: Geometry, polygon 
  9. Sender: usenet@hkusuc.hku.hk
  10. Organization: The University of Hong Kong
  11. X-Newsreader: TIN [version 1.1 PL6]
  12. Date: Fri, 5 Jan 1996 15:15:19 GMT
  13.  
  14. Dear all, 
  15.      Can anoyone solve the problem concerning the 2D polygon problem.
  16.     
  17. I need an algorithm to check the  points and output as a simple closed  
  18. polygon. The points are arbitary chosen. 
  19.  
  20. I have thought of checking the intersection between each lines 
  21. (combinations) joined by the vertices but I don't know whether such 
  22. algorithm work and don't exactly know how to start to write the syntax in 
  23. C-prog.  Any experts can help me???
  24. Thanks in advance!
  25.  
  26.  
  27.  
  28. --
  29. ~~~~~
  30. Best Regards and Wishes
  31.  
  32.         **                             **                                
  33.           ******                ******             
  34.             00      .....         00                 
  35.         >   ..       . .          ..  <
  36.          >.           +             << 
  37.              <<   ,,,,,,,,,,  >>
  38.                      ,,,,                       Thanks! 
  39.                       
  40.  ___________
  41. | Chi-Ping |____________________________________________________
  42. | Department of Industrial and Manufacturing Systems Engineering. 
  43. | University of HongKong                       IMSE 3
  44. | h9300377@hkusub.hku.hk                                        .  
  45. ..............................................................  
  46.  
  47.